Groups with Context-free Co-word Problem
نویسندگان
چکیده
The class of co-context-free groups is studied. A co-context-free group is defined as one whose coword problem (the complement of its word problem) is context-free. This class is larger than the subclass of context-free groups, being closed under the taking of finite direct products, restricted standard wreath products with context-free top groups, and passing to finitely generated subgroups and finite index overgroups. No other examples of co-context-free groups are known. It is proved that the only examples amongst polycyclic groups or the Baumslag–Solitar groups are virtually abelian. This is done by proving that languages with certain purely arithmetical properties cannot be context-free; this result may be of independent interest.
منابع مشابه
Context-Freeness of Higman-Thompson group’s co-word problem
The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to show, that the Higman-Thompson groups, and therefore the Houghton groups, have context-free co-word problem. We also give some examples of groups, that even have...
متن کاملLocal Similarity Groups with Context-free Co-word Problem
Let G be a group, and let S be a finite subset of G that generates G as a monoid. The co-word problem is the collection of words in the free monoid S that represent non-trivial elements of G. A current conjecture, based originally on a conjecture of Lehnert and modified into its current form by Bleak, Matucci, and Neuhöffer, says that Thompson’s group V is a universal group with context-free co...
متن کاملWord Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملGroups with poly-context-free word problem
We consider the class of groups whose word problem is poly-contextfree; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free groups has poly-context-free word problem, and conjecture that the converse also holds. We prove our conjecture for several classes of soluble groups, includin...
متن کاملA dynamical definition of f.g. virtually free groups
We show that the class of finitely generated virtually free groups is precisely the class of demonstrable subgroups for R. Thompson’s group V . The class of demonstrable groups for V consists of all groups which can embed into V with a natural dynamical behaviour in their induced actions on the Cantor space C2 := {0, 1}. There are also connections with formal language theory, as the class of gr...
متن کامل